Degree conditions on claws and modified claws for hamiltonicity of graphs
نویسندگان
چکیده
منابع مشابه
Dirac's minimum degree condition restricted to claws
Let G be a graph on n t> 3 vertices. Dirac's minimum degree condition is the condition that all vertices of G have degree at least in. This is a well-known sufficient condition for the existence of a Hamilton cycle in G. We give related sufficiency conditions for the existence of a Hamilton cycle or a perfect matching involving a restriction of Dirac's minimum degree condition to certain subset...
متن کاملDistance-regular graphs without 4-claws
We determine the distance-regular graphs with diameter at least 3 and c2 ≥ 2 but without induced K1,4-subgraphs.
متن کاملVertex-disjoint t-claws in graphs
Let δ(G) denote the minimum degree of a graph G. We prove that for t ≥ 4 and k ≥ 2, a graph G of order at least (t + 1)k + 11 6 t 2 with δ(G) ≥ k + t − 1 contains k pairwise vertex-disjoint copies of K1,t.
متن کاملClaws for thought
What are the early signs of use? There are no early signs. There are only obvious signs common to all long-term users. What can be spotted is the transition from non-user to addict (one episode is sufficient for diagnosis). For example, an early draft of a manuscript may read “We replicated and extended a classic finding within an established theoretical framework...”; a later SciagraTM-influen...
متن کاملGenus Distributions for Iterated Claws
We derive a recursion for the genus distributions of the graphs obtained by iteratively attaching a claw to the dipole D3. The minimum genus of the graphs in this sequence grows arbitrarily large. The families of graphs whose genus distributions have been calculated previously are either planar or almost planar, or they can be obtained by iterative single-vertex or single-edge amalgamation of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.04.018